An Unconnected Heap of Duties?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Implementation of Distributed Unconnected Graph Determination in Sensor Networks

This paper details recent progress toward implementing and testing in hardware an unconnected graph determination algorithm for distributed sensor networks. Specifically, we address the question of enabling a distributed sensor network to determine if it was been fragmented into two disjoint networks due to a large scale event. We present the problem, propose a solution, and detail the progress...

متن کامل

An Incremental Heap Canonicalization Algorithm

The most expensive operation in explicit state model checking is the hash computation required to store the explored states in a hash table. One way to reduce this computation is to compute the hash incrementally by only processing those portions of the state that are modified in a transition. This paper presents an incremental heap canonicalization algorithm that aids in such an incremental ha...

متن کامل

Mining Unconnected Patterns in Workflows

This paper investigates the problem of mining unconnected patterns in workflows and presents for its solution two algorithms, both adapting the Apriori approach to the graphical structure of workflows. The first one is a straightforward extension of the level-wise style of Apriori whereas the second one introduces sophisticated graphical analysis of the frequencies of workflow instances. The ex...

متن کامل

An Equation-Based Heap Sizing RuleI

For garbage-collected applications, dynamically-allocated objects are contained in a heap. Programmer productivity improves significantly if there is a garbage collector to automatically de-allocate objects that are no longer needed by the applications. However, there is a run-time performance overhead in garbage collection, and this cost is sensitive to heap size H : a smaller H will trigger m...

متن کامل

Heap Analysis Design: An Empirical Approach

Despite extensive research the construction of a precise and scalable static heap analysis for object-oriented programs remains an open problem. This paper argues that much of the difficulty is the result of empirically unvalidated and inappropriate design decisions. We examine three of them and determine that in practice: (1) strong updates are not necessary for obtaining precise results (2) f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Philosophical Quarterly

سال: 1996

ISSN: 0031-8094

DOI: 10.2307/2956354